Local Community Detection Based on Small Cliques
نویسندگان
چکیده
منابع مشابه
Local Community Detection Based on Small Cliques
Community detection aims to find dense subgraphs in a network. We consider the problem of finding a community locally around a seed node both in unweighted and weighted networks. This is a faster alternative to algorithms that detect communities that cover the whole network when actually only a single community is required. Further, many overlapping community detection algorithms use local comm...
متن کاملMclip: motif detection based on cliques of gapped local profile-to-profile alignments
UNLABELLED A multitude of motif-finding tools have been published, which can generally be assigned to one of three classes: expectation-maximization, Gibbs-sampling or enumeration. Irrespective of this grouping, most motif detection tools only take into account similarities across ungapped sequence regions, possibly causing short motifs located peripherally and in varying distance to a 'core' m...
متن کاملOverlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
متن کاملCommunity Detection Algorithm Based on Local Expansion K-means
Community structure implies some features in various real-world networks, and these features can help us to analysis structural and functional properties in the complex system. It has been proved that the classic k-means algorithm can efficiently cluster nodes into communities. However, initial seeds decide the efficiency of the k-means, especially when detecting communities with different size...
متن کاملHierarchical Community Detection Algorithm based on Local Similarity
Although community, one of the general characteristics of complex networks, has obvious hierarchical structure, in-depth research on its application in the current community detection algorithms is limited. In this paper we present a novel hierarchical community detection algorithm which starts from the node similarity calculation based on local adjacency in networks. Then we find the initial c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algorithms
سال: 2017
ISSN: 1999-4893
DOI: 10.3390/a10030090